(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
g(Cons(x, xs), y) → Cons(x, xs)
h(Nil, y) → h(Nil, y)
h(Cons(x, xs), y) → f(Cons(x, xs), y)
g(Nil, y) → h(Nil, y)
f(Nil, y) → g(Nil, y)
f(Cons(x, xs), y) → h(Cons(x, xs), y)
sp1(x, y) → f(x, y)
r(x, y) → x
Rewrite Strategy: INNERMOST
(1) InfiniteLowerBoundProof (EQUIVALENT transformation)
The loop following loop proves infinite runtime complexity:
The rewrite sequence
h(Nil, y) →+ h(Nil, y)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [ ].
The result substitution is [ ].
(2) BOUNDS(INF, INF)